Normalisation in Lambda Calculus and its relation to Type Inference
نویسنده
چکیده
rewriting system, 16irreflexive, 33weakly irreflexive, 33with typing, 37, 40with very weak typing, 40with weak typing, 40abstract rewriting systemsIn, 16I, 16abstract typing system, 38 bound variable, 52, 90, 137BV, 52, 90, 137 categoriesArs, 17Arst, 41Arstw, 41Carst, 46Carst""'' 46Carstw, 46Spec, 88Ats, 38common-reduct strategiesF, 124F++, 127Ftt, 177F+, 126Fn, 123Fib 177conditionII, 98confluent, 18, 19, 44context, 38, 44, 52conversiona:-conversion, 52, 91, 138 199.8-conversion, 2conversion *""*• 16definition, 6global, 6, 136local, 6, 136depth depth, 103development, 2, 65, 66environment, 38, 44environmentalabstract rewriting system, 43with typing, 38, 45with very weak typing, 45with weak typing, 45abstract typing system, 44extension, 17, 38, 45conservative, 17, 38strong, 17free variable, 52, 90, 136FV, 51, 90, 136illegal .8-redex, 110illegal .8-reduction, 115illegal abstraction, 110inhabitation, 8inhabited, 37, 38, 45interpretation, 46 lambda cube, 93lambda terms, 1, 51A, 51legal abstraction, 110lifting, 18loop, 33one-step, 33
منابع مشابه
Strong Normalisation of Cut-Elimination that Simulates β-Reduction Long version
This paper is concerned with strong normalisation of cutelimination for a standard intuitionistic sequent calculus. The cut-elimination procedure is based on a rewrite system for proof-terms with cut-permutation rules allowing the simulation of β-reduction. Strong normalisation of the typed terms is inferred from that of the simply-typed λ-calculus, using the notions of safe and minimal reducti...
متن کاملStrong Normalisation of Cut-Elimination that Simulates β-Reduction
This paper is concerned with strong normalisation of cutelimination for a standard intuitionistic sequent calculus. The cutelimination procedure is based on a rewrite system for proof-terms with cut-permutation rules allowing the simulation of β-reduction. Strong normalisation of the typed terms is inferred from that of the simply-typed λ-calculus, using the notions of safe and minimal reductio...
متن کاملA Proof of Strong Normalisation of the Typed Atomic Lambda-Calculus
The atomic lambda-calculus is a typed lambda-calculus with explicit sharing, which originates in a Curry-Howard interpretation of a deep-inference system for intuitionistic logic. It has been shown that it allows fully lazy sharing to be reproduced in a typed setting. In this paper we prove strong normalization of the typed atomic lambda-calculus using Tait’s reducibility method.
متن کاملSimply Typed Lambda-Calculus Modulo Type Isomorphisms
We define a simply typed, non-deterministic lambda-calculus where isomorphic types are equated. To this end, an equivalence relation is settled at the term level. We then provide a proof of strong normalisation modulo equivalence. Such a proof is a non-trivial adaptation of the reducibility method.
متن کاملStrong Normalisation in the π-Calculus
We introduce a typed π-calculus where strong normalisation is ensured by typability. Strong normalisation is a useful property in many computational contexts, including distributed systems. In spite of its simplicity, our type discipline captures a wide class of converging name-passing interactive behaviour. The proof of strong normalisability combines methods from typed λ-calculi and linear lo...
متن کامل